Optimality Theory and the Problem of Constraint Aggregation

ثبت نشده
چکیده

1. The Issue Of recent changes in linguistic theory, the shift from derivations to constraints is among the most substantive. Central to this is Optimality Theory (OT; Prince & Smolenksy 1993), which – unlike, e.g., Chomsky & Lasnik’s Filters or Pān. ini’s As.t.ādhyāȳı – claims that structural well-formedness (grammaticality) is enforced by sharply conflicting, mutually incompatible constraints. As it is impossible to satisfy all constraints simultaneously, grammars must resolve conflicts to determine an input’s ‘surface representation’, the form ‘most harmonic’ with the constraints. Prince & Smolensky, and most subsequent work, resolve conflicts by ‘rank[ing] constraints in a strict dominance hierarchy ’. We question this position and develop a formal mathematical approach to constraint-conflict resolution. This facilitates a recharacterisation of OT’s difficulties into problems for constraint-based grammar per se versus problems that are artefacts of conflict-resolution via strict dominance hierarchies. The formalism also shows that OT occupies a well-defined position in the space of logically possible constraint-based grammars and that modifications to OT (e.g., Sympathy Theory (McCarthy 1998); Boolean operations on constraints (Crowhurst & Hewitt 1999)) diverge from OT uniformly, on one formal ‘dimension’. So, we may classify these modifications according to how greatly they increase the power of the theory. Further, we can determine what phenomena fall fully beyond the logical remit of constraint-based theories, and can provide a condition that a theory must satisfy in order to count as being constraint-based. This establishes two falsifiability criteria for Prince & Smolensky’s claim that ‘Universal Grammar consists largely of a set of constraints on representational wellformedness’ and that grammaticality is a matter of structural well-formedness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

Optionality and Gradience in Persian Phonology: An Optimality Treatment

The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...

متن کامل

Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Two-echelon Supply Chain Considering Multiple Retailers with Price and Promotional Effort Sensitive Non-linear Demand

This study deals with the effects of a supply chain (SC) with single product, multiple retailers and a manufacturer, where the manufacturer(he) produces lotsize of the product that contains a random portion of imperfect quality item. The imperfect quality products are sold in a secondary shop. The new contribution of this paper is a new non-linear demand function. Demand of the end customers va...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001